State complexity of deletion and bipolar deletion
نویسندگان
چکیده
منابع مشابه
State Complexity of Deletion
It is well known that the language obtained by deleting an arbitrary language from a regular language is regular. We give an upper bound for the state complexity of deleting an arbitrary language from a regular language and a matching lower bound. We show that the state complexity of deletion is n · 2n−1 (respectively, (n + 1 2 ) · 2 − 2) when using complete (respectively, incomplete) determini...
متن کاملMulti-Tuple Deletion Propagation: Approximations and Complexity
This paper studies the computational complexity of the classic problem of deletion propagation in a relational database, where tuples are deleted from the base relations in order to realize a desired deletion of tuples from the view. Such an operation may result in a (sometimes unavoidable) side effect: deletion of additional tuples from the view, besides the intentionally deleted ones. The goa...
متن کاملBivariate Complexity Analysis of Almost Forest Deletion
In this paper we study a generalization of classic Feedback Vertex Set problem in the realm of multivariate complexity analysis. We say that a graph F is l-forest if we can delete l edges from F to get a forest. That is, F is l edges away from being a forest. In this paper we introduce the Almost Forest Deletion problem. In this problem given a graph G and integers k and l, the question is whet...
متن کاملParameterized Complexity of Fair Deletion Problems
Edge deletion problems are those where given a graph G and a graph property π, the goal is to find a subset of edges such that after its removal the graph G will satisfy the property π. Typically, we want to minimize the number of edges removed. In fair deletion problem we change the objective: we minimize the maximum number of edges incident to a single vertex. We study the parameterized compl...
متن کاملParameterized complexity of fair deletion problems II
Vertex deletion problems are those where given a graph G and a graph property π, the goal is to find a subset of vertices W such that G \W satisfies property π. Typically, we want to minimize size of the deletion set W . Unlike this, in fair vertex deletion problems we change the objective: we minimize the maximum number of vertices deleted in neighborhood of any vertex. When the property π is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Informatica
سال: 2015
ISSN: 0001-5903,1432-0525
DOI: 10.1007/s00236-015-0245-y